Nonabelian Multiplicative Cellular Automata
نویسنده
چکیده
If M = Z, and G is a finite (nonabelian) group, then G is a compact group; a multiplicative cellular automaton (MCA) is a continuous transformation F : G − ←⊃ which commutes with all shift maps, and where nearby coordinates are combined together using the multiplication operator of G. We provide equivalent conditions for MCA to be group endomorphisms of G, and show how MCA on G inherit a natural structure theory from the structure of G. We then apply this structure theory to compute the measurable entropy of MCA, and to study convergence of initial measures to Haar measure.
منابع مشابه
Multiplicative Cellular Automata on Nilpotent Groups: Structure, Entropy, and Asymptotics
If M = ZD, and B is a finite (nonabelian) group, then B is a compact group; a multiplicative cellular automaton (MCA) is a continuous transformation G : B−→ B which commutes with all shift maps, and where nearby coordinates are combined using the multiplication operation of B. We characterize when MCA are group endomorphisms of B, and show that MCA on B inherit a natural structure theory from t...
متن کاملEdge Detection Based On Nearest Neighbor Linear Cellular Automata Rules and Fuzzy Rule Based System
Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...
متن کاملMultiplicative Jordan Decomposition in Group Rings of 3-groups, Ii
In this paper, we complete the classification of those finite 3groups G whose integral group rings have the multiplicative Jordan decomposition property. If G is abelian, then it is clear that Z[G] satisfies MJD. In the nonabelian case, we show that Z[G] satisfies MJD if and only if G is one of the two nonabelian groups of order 33 = 27.
متن کاملMultiplicative Jordan Decomposition in Group Rings of 3-groups
In this paper, we essentially classify those finite 3-groups G having integral group rings with the multiplicative Jordan decomposition property. If G is abelian, then it is clear that Z[G] satisfies MJD. Thus, we are only concerned with the nonabelian case. Here we show that Z[G] has the MJD property for the two nonabelian groups of order 33. Furthermore, we show that there are at most three o...
متن کاملImproved Frog Leaping Algorithm Using Cellular Learning Automata
In this paper, a new algorithm which is the result of the combination of cellular learning automata and frog leap algorithm (SFLA) is proposed for optimization in continuous, static environments.At the proposed algorithm, each memeplex of frogs is placed in a cell of cellular learning automata. Learning automata in each cell acts as the brain of memeplex, and will determine the strategy of moti...
متن کامل